Bounded Model Checking for Timed Automata1 1This research was supported by the National Science Foundation under grants CCR-00-82560 and CCR-00-86096.

Predicate Abstraction for Dense Real-Time Systems

We propose predicate abstraction as a means for verifying a rich class of safety and liveness properties for dense real-time systems. First, we define a restricted semantics of timed systems which is observationally equivalent to the standard semantics in that it validates the same set of μ-calculus formulas without a next-step operator. Then, we recast the model checking problem S |= φ for a t...

2 3 M ay 2 00 7 GENERALIZED CCR FLOWS

We introduce a new construction of E0-semigroups, called generalized CCR flows, with two kinds of descriptions: those arising from sum systems and those arising from pairs of C0-semigroups. We get a new necessary and sufficient condition for them to be of type III, when the associated sum system is of finite index. Using this criterion, we construct examples of type III E0-semigroups, which can...

Nanomechanical Fingerprints of UV Damage To DNAThis work was supported by grants from the National Science Foundation and the National Institutes of Health

DNA mechanics critically affects the fundamental biological processes of transcription, replication, recombination, and repair. Therefore, DNA mechanics has been extensively studied since the structure of DNA was resolved. Recent progress in the techniques that allow mechanical manipulations of single-polymer molecules has made it possible to carry out very accurate measurements of DNA elastici...

Bounded Model Checking for Timed Automata

Bounded Model Checking for Timed Systems

Enormous progress has been achieved in the last decade in the verification of timed systems, making it possible to analyze significant real-world protocols. An open challenge is the identification of fully symbolic verification techniques, able to deal effectively with the finite state component as well as with the timing aspects. In this paper we propose a new, symbolic verification technique ...